Scheduling in parallel machines with two objectives: analysis of factors that influence the Pareto frontier

Abstract This paper explores the characteristics of solutions when scheduling jobs in a shop with parallel machines. Three classical objective functions were considered: makespan, total completion time, and tardiness. These three criteria combined pairs, resulting bi-objective formulations. formulations solved using ε-constraint method to obtain Pareto frontier for each pair. The research is evaluate set efficient schedules characterize solution sets. characterization sets based on two performance metrics: span functions' values points their closeness ideal point. Results that consider four experimental factors indicate makespan one functions, range processing times among has significant influence frontier. Simultaneously, slack due dates most relevant factor tardiness considered.